Joint Iterative Decoding of Trellis-Based VQ and TCM
نویسندگان
چکیده
منابع مشابه
Graph-based iterative decoding algorithms for parity-concatenated trellis codes
In this paper, we construct parity-concatenated trellis codes in which a trellis code is used as the inner code and a simple parity-check code is used as the outer code. From the Tanner–Wiberg–Loeliger (TWL) graph representation, several iterative decoding algorithms can be derived. However, since the graph of the parity-concatenated code contains many short cycles, the conventional min-sum and...
متن کاملIterative Demodulation and Decoding of Trellis Coded CPM
Interleaved trellis coded systems with continuous phase modulation (TCCPM) are considered. It is shown that the combination of a trellis code, interleaver and the CPM modulator results in a significantly enhanced distance spectrum for the transmitted signals. Upper bounds on the bit error rate are derived by considering the combination of the trellis code, interleaver and the CPM modulator as s...
متن کاملPerformance of trellis-coded CPM with iterative demodulation and decoding
Interleaved trellis-coded systems with full response continuous-phase modulation (CPM) are considered. Upper bounds on the bit-error rate performance are derived for coherent detection on the additive white Gaussian noise and flat Rayleigh fading channels by considering the trellis code, interleaver, and CPM modulator as a serially concatenated convolutional code. A coherent receiver that perfo...
متن کاملEarly Detection and Trellis Splicing: Reduced-Complexity Iterative Decoding
The excellent bit-error rate (BER) performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding procedure. In this paper, we present a method called early detection that can be used to reduce the computational complexity of a variety of iterative decoders. Using a confidence criterion, some information symbols, state ...
متن کاملEarly Detection and Trellis Splicing Reduced Complexity Soft Iterative Decoding
The excellent bit error rate performance of new soft iter ative decoding algorithms eg turbo codes is achieved at the expense of a computationally burdensome itera tive decoding procedure In this paper we present a new method called early detection that can be used to reduce the computational complexity of a variety of soft iterative decoding methods Using a con dence criterion some in formatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Wireless Communications
سال: 2007
ISSN: 1536-1276
DOI: 10.1109/twc.2007.348329